Dynamic categorization of clinical research eligibility criteria by hierarchical clustering

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic categorization of clinical research eligibility criteria by hierarchical clustering

OBJECTIVE To semi-automatically induce semantic categories of eligibility criteria from text and to automatically classify eligibility criteria based on their semantic similarity. DESIGN The UMLS semantic types and a set of previously developed semantic preference rules were utilized to create an unambiguous semantic feature representation to induce eligibility criteria categories through hie...

متن کامل

Patterns of Clinical Trial Eligibility Criteria

Medical research would benefit from automatic methods that support eligibility evaluation for patient enrollment in clinical trials and design of eligibility criteria. In this study we addressed the problem of formalizing eligibility criteria. By analyzing a large set of breast cancer clinical trials we derived a set of patterns, that capture typical structure of conditions, pertaining to synta...

متن کامل

Research of Hierarchical Clustering Based on Dynamic Granular Computing

Hierarchical clustering algorithm of cluster analysis method can detect data in different granularity levels, and the clustering process is suitable for most of practical problems, but complexity of the merger and split conditions limits its application. This paper proposed a new hierarchical clustering algorithm basis on dynamic fuzzy granular computing combining with the particle swarm optimi...

متن کامل

Dynamic Hierarchical Clustering

We describe a new method for dynamically clustering hierarchical data which maintains good clustering in the presence of insertions and deletions. This method, which we call Enc, encodes the insertion order of children with respect to their parents and concatenates the insertion numbers to form a compact key for the data. We compare Enc with some more traditional approaches and show in what cir...

متن کامل

Isotropic Dynamic Hierarchical Clustering

We face a business need of discovering a pattern in locations of a great number of points in a high-dimensional space. We assume that there should be a certain structure, so that in some locations the points are close while in other locations the points are more dispersed. Our goal is to group the close points together. The process of grouping close objects is known under the name of clustering...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Biomedical Informatics

سال: 2011

ISSN: 1532-0464

DOI: 10.1016/j.jbi.2011.06.001